Inherent enumerability of strong jump-traceability

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Beyond Strong Jump Traceability

Strong jump traceability has been studied by various authors. In this paper we study a variant of strong jump traceability by looking at a partial relativization of traceability. We discover a new subclass H of the c.e. K-trivials with some interesting properties. These sets are computationally very weak, but yet contains a cuppable member. Surprisingly they cannot be constructed using cost fun...

متن کامل

Superhighness and Strong Jump Traceability

Let A be c.e. Then A is strongly jump traceable if and only if A is Turing below each superhigh Martin-Löf-random set.

متن کامل

Strong Jump-traceability I : the Computably Enumerable Case

Recent investigations in algorithmic randomness have lead to the discovery and analysis of the fundamental class K of reals called the K-trivial reals, defined as those whose initial segment complexity is identical with that of the sequence of all 1’s. There remain many important open questions concerning this class, such as whether there is a combinatorial characterization of the class and whe...

متن کامل

Inherent Characteristics of Traceability Artifacts

This paper describes ongoing work to characterize the inherent ease or “traceability” with which a textual artifact can be traced using an automated technique. Software traceability approaches use varied measures to build models that automatically recover links between pairs of natural language documents. Thus far, most of the approaches use a single-step model, such as logistic regression, to ...

متن کامل

Recursive Enumerability

One of the fundamental contributions of mathematical logic has been the precise definition and study of algorithms and the closely associated study of recursively enumerable sets. A subset A £ co is recursive (decidable) if there is an algorithm for computing its characteristic function cA and recursively enumerable (r.e.) if there is an algorithm for generating its members. Nonrecursive r.e. s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 2014

ISSN: 0002-9947,1088-6850

DOI: 10.1090/s0002-9947-2014-06089-3